Proving Conditional Termination
نویسندگان
چکیده
We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination—a long-standing open problem. The paper provides experimental evidence to demonstrate the usefulness of the new procedure.
منابع مشابه
Proving Termination Through Conditional Termination
We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs. Our key insight is that a conditional termination proof shows termination for a subset of program execution states which do not need to be consid...
متن کاملModels for Logics and Conditional Constraints in Automated Proofs of Termination
Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solvin...
متن کاملOn Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems
We define the notion of context-sensitive quasi-reductivity which implies operational termination of deterministic conditional term rewriting systems. Furthermore, we show how existing transformations from such systems into unconditional ones can be used (with slight modifications) to prove context-sensitive quasi-reductivity. Finally, we give a few equivalent characterizations of this notion.
متن کاملتوسعه روش SL با ترتیب KBO برای اثبات خودکار پایانپذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملCharacterizing and proving operational termination of deterministic conditional term rewriting systems
We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming paradigm. We show that operational termination can be equivalently characterized by the newly introduced notion of context-sensitive quasi-reductivity. Based on this characterization and an unraveling transformation of DCTR...
متن کاملProving Termination Starting from the End
We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program remains the same. Our technique goes a step further. We show how to use the current partial proof to partition the transition relation into those behaviors know...
متن کامل